A simple shower and matching algorithm
نویسندگان
چکیده
منابع مشابه
A simple shower and matching algorithm
We present a simple formalism for parton-shower Markov chains. As a first step towards more complete ‘uncertainty bands’, we incorporate a comprehensive exploration of the ambiguities inherent in such calculations. To reduce this uncertainty, we then introduce a matching formalism which allows a generated event sample to simultaneously reproduce any infrared safe distribution calculated at lead...
متن کاملA Simple and Efficient Template Matching Algorithm
We propose a general framework for object tracking in video images. It consists in low-order parametric models for the image motion of a target region. These models are used to predict the movement and to track the target. The difference of intensity between the pixels belonging to the current region and the pixels of the selected target (learnt during an off-line stage) allows a straightforwar...
متن کاملA Simple Parallel Dictionary Matching Algorithm
In the Parallel Dictionary Matching problem a set of patterns D is xed at the beginning, and the following Query(T) operation has to be quickly supported: given an arbitrary text T 1; t], for each text position i retrieve the longest pattern in D that is a preex of T i; t]. In this paper, we present a simple and space-eecient CRCW PRAM algorithm which takes optimal work to answer Query(T) in th...
متن کاملA Simple Fast Hybrid Pattern-Matching Algorithm
The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer–Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with ...
متن کاملA Simple Algorithm for Maximum Clique and Matching Protein Structures
The maximum common subgraph (MCS) problem has become increasingly important in matching protein structures of two proteins. Two proteins represented as graphs by simple contact map and product of these graphs was input to the proposed algorithm. A maximum clique in the product graph, found by the proposed algorithm, provides a measure of the structural similarity between the two proteins. The p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2008
ISSN: 1550-7998,1550-2368
DOI: 10.1103/physrevd.78.014026